AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance

نویسندگان

  • Debabala Swain
  • Bijay Paikaray
  • Debabrata Swain
چکیده

Due to the huge difference in performance between the computer memory and processor , the virtual memory management plays a vital role in system performance .A Cache memory is the fast memory which is used to compensate the speed difference between the memory and processor. This paper gives an adaptive replacement policy over the traditional policy which has low overhead, better performance and is easy to implement. Simulations show that our algorithm performs better than Least-Recently-Used (LRU), First-In-First-Out (FIFO) and Clock with Adaptive Replacement (CAR).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Who Is More Adaptive? ACME: Adaptive Caching using Multiple Experts

The trend in cache design research is towards finding the single optimum replacement policy that performs better than any other proposed policy by using all the useful criteria at once. However, due to the variety of workloads and system topologies it is daunting, if not impossible, to summarize all this information into one magical value using any static formula. We propose a workload and topo...

متن کامل

A Replacement Algorithm Based on Weighting and Ranking Cache Objects

Caching is one of the major steps in system designing to reach a higher performance in operating systems, databases and World Wide Web. High performance processors need memory systems with a proper access time, but still there is a big gap between performances of processors and memory systems. Virtual memory management and hierarchical memory models play an important role in system performance....

متن کامل

Adaptive Cache Replacement:A Novel Approach

Cache replacement policies are developed to help insure optimal use of limited resources. Varieties of such algorithms exist with relatively few that dynamically adapt to traffic patterns. Algorithms that are tunable typically utilize offline training mechanisms or trial-and-error to determine optimal characteristics. Utilizing multiple algorithms to establish an efficient replacement policy th...

متن کامل

WARP: Workload Nature Adaptive Replacement Policy

In the present universal scenario where the dependence on heterogeneous multi-core processors is tremendous, dealing with algorithms focusing on coherence between shared caches is imperative. WARP redesigns the replacement policy in the last level cache. In this policy, the shared (clean) lines and the private exclusive line are given the first two priorities dynamically followed by private mod...

متن کامل

Adaptive Compressed Caching: Design and Implementation

In this paper, we reevaluate the use of adaptive compressed caching in order to improve system performance through reduction of accesses to the backing stores. We propose a new and simple adaptability policy that adjusts the compressed cache size on-the-fly, and evaluate a compressed caching system with this policy through an implementation in a widely used operating system, Linux. We also rede...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1107.4851  شماره 

صفحات  -

تاریخ انتشار 2011